Partial-Order Planning with Concurrent Interacting Actions
نویسندگان
چکیده
In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting e ects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modi cations, the STRIPS action representation language can be used to represent interacting actions. Moreover, algorithms for partial-order planning require only small modi cations in order to be applied in such multiagent domains. We demonstrate this fact by developing a sound and complete partial-order planner for planning with concurrent interacting actions, POMP, that extends existing partial-order planners in a straightforward way. These results open the way to the use of partial-order planners for the centralized control of cooperative multiagent systems.
منابع مشابه
Planning with Concurrent Interacting Actions
In order to generate plans for agents with multiple actuators or agent teams, we must be able to represent and plan using concurrent actions with interacting effects. Historically, this has been considered a challenging task that could require a temporal planner. We show that, with simple modifications, the STRIPS action representation language can be used to represent concurrent interacting ac...
متن کاملPartial - Order Planning with Concurrent Interacting
In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting eeects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modiications, the STRIPS action representati...
متن کاملTowards the Construction of an Abstract State-Space from a Partial-Order Representation of the Concrete One
When analysing a concurrent program in order to verify its correctness one faces a severe complexity problem: state-spaces corresponding to concurrent programs become tremendously large. To cope with this problem of state-space explosion, two diierent t ypes of approaches have been established: abstraction techniques and partial-order methods. Abstraction aims at reducing the number of states b...
متن کاملDefeasible Reasoning and Partial Order Planning
Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents repre...
متن کاملModels of Action Concurrency in Temporal Planning
Models of temporal planning are complex, due to the possibility of multiple concurrent and mutually interacting actions. This work compares two modeling languages, one with a PDDL-style action exclusion mechanism, and another with an explicit notion of resources, and investigates their implications on constraint-based search. The first mechanism forces temporal gaps in action schedules and have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Artif. Intell. Res.
دوره 14 شماره
صفحات -
تاریخ انتشار 2001